Gradient-enhanced TROSY described with Cartesian product operators
نویسندگان
چکیده
منابع مشابه
Gradient-Enhanced TROSY Described with Cartesian Product Operators
TROSY, Transverse Relaxation Optimized Spectroscopy, was developed more than a decade ago. Since that time, the N-H HSQC-TROSY experiment has become the standard ‘fingerprint’ correlation spectrum for proteins of high molecular weight. In addition, its implementation in protein triple resonance experiments has pushed the boundaries of NMR assignment up to about 100 kDa, making NMR a highly rele...
متن کاملData dependence theorems for operators on cartesian product spaces
We present some abstract data dependence theorems of the fixed point set for operators f, g : X × Y → X × Y , using the c-Picard operators technique. 2000 Mathematical Subject Classification: 47H10.
متن کاملCartesian Product of Functions
For simplicity we follow the rules: x, y, y1, y2, z, a will be arbitrary, f , g, h, h′, f1, f2 will denote functions, i will denote a natural number, X, Y , Z, V1, V2 will denote sets, P will denote a permutation of X, D, D1, D2, D3 will denote non-empty sets, d1 will denote an element of D1, d2 will denote an element of D2, and d3 will denote an element of D3. We now state a number of proposit...
متن کاملThe reliability Wiener number of cartesian product graphs
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
متن کاملConnectivity of Cartesian product graphs
Use vi , i , i , i to denote order, connectivity, edge-connectivity and minimum degree of a graphGi for i=1, 2, respectively. For the connectivity and the edge-connectivity of the Cartesian product graph, up to now, the best results are (G1×G2) 1+ 2 and (G1×G2) 1+ 2. This paper improves these results by proving that (G1×G2) min{ 1+ 2, 2+ 1} and (G1×G2)= min{ 1+ 2, 1v2, 2v1} ifG1 andG2 are conne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Concepts in Magnetic Resonance Part A
سال: 2011
ISSN: 1546-6086
DOI: 10.1002/cmr.a.20228